The Automatic Computer Scientist
نویسندگان
چکیده
Algorithms are ubiquitous: they track our sleep, help us find cheap flights, and even see black holes. However, designing novel algorithms is extremely difficult, we do not have efficient for many fundamental problems. The goal of my research to accelerate algorithm discovery by building an automatic computer scientist. To work towards this goal, focuses on inductive logic programming, a form machine learning in which collaborators I demonstrated major advances automated over the past five years. In talk paper, survey these advances.
منابع مشابه
Safecracking for the computer scientist∗
This paper is a general survey of safe and vault security from a computer science perspective, with emphasis on the metrics used to evaluate these systems and the weaknesses that cause them to fail. We examine security against forced, covert and surreptitious safe opening, focusing on the mechanical combination locks most commonly used on commercial safes in the US. Our analysis contrasts the p...
متن کاملComputer Scientist The 21st Century Renaissance Man
Since the Renaissance, figures like Leonardo da Vinci, Isaac Newton and Albert Einstein, to name but a few, have played a fundamental role in the development of our civilization. So much so that those exceptional human beings are part of the collective memory of humankind, and make guest appearances in everyday conversations amongst people who normally have little or no concern for art or scien...
متن کاملA computer scientist looks at game theory
I consider issues in distributed computation that should be of relevance to game theory. In particular, I focus on (a) representing knowledge and uncertainty, (b) dealing with failures, and (c) specification of mechanisms. 2003 Elsevier Inc. All rights reserved. JEL classification: D80; D83
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence
سال: 2023
ISSN: ['2159-5399', '2374-3468']
DOI: https://doi.org/10.1609/aaai.v37i13.26801